Covering all aspects of computing with constraints; on paper or online; fee required.

For incremental dataflow constraint solver, implemented in varied languages, each in a subdirectory named after the language: C DEC, C SUN4; Common Lisp, Smalltalk.

Efficient, incremental local propagation constraint solver. Like most local propagation algorithms, it cannot accommodate cyclic constraints. University of Washington site.

Constraint solver benchmark, in Java; about 1000 lines of code. DeltaBlue first implemented by John Maloney at University of Washington, translated to many languages: C, C++, Java; Smalltalk. [Sun Microsystems Labs]

Home of Explanation-based Constraint Programming. Definitions, applications, libraries, links.

By AEM Design: a source code for minimizing the maximum of a set of smooth objective functions subject to general smooth constraints. Two versions, written in portable: Fortran 77 (FFSQP), standard C (CFSQP). Both are tested and run on most platforms.

Generating an Amalgam of Real-time, Novel Editors and Toolkits; developed by User Interface Software Group, Human Computer Interaction Institute, School of Computer Science, Carnegie Mellon University. Free: public domain.

Frequently Asked Questions about Garnet user interface development environment for Common Lisp and X11 or Macintosh developed by User Interface Software Group, Human-Computer Interaction Institute, Carnegie Mellon University.

Personal page of Garnet inventor and lead researcher. Describes Garnet motives, rationale.

ResearchIndex: Constraints provide a useful mechanism to maintain relations in user interface toolkits. Garnet is a widely used user interface toolkit with high functionality, based on one way, required constraints. Multi-Garnet extends this by adding...